Method for Provisioning a Wireless Network

ABSTRACT

A method that collects data and subjects it to statistical analysis to detect localized events, which assists in network provisioning. Illustratively, the data employed is hourly network traffic count that is collected at cell sites. By taking the advantage of additive property of Poisson process, the method integrates spatial neighbor information by aggregating temporal data in various areas, and iteratively estimating the event location and the radius of event impact by examining the posterior probability base on the aggregated data.

BACKGROUND OF THE INVENTION

This relates to development of information from traffic data of a wireless network, where the data includes events that are outside everyday network load. This information assists in anticipating future events and their geographical impact, and thereby assists in provisioning network capacity.

With the fast development of mobility network technology, the network traffic has increased significantly. To improve the mobility network performance, service providers have invested significant resources to improve the coverage, enhance the quality, and increase the capacity. To illustrate, AT&T has invested more than $1.5 billion from 2007 to 2009 in California alone, and a Verizon-led investment group is committing to invest $1.3 billion in wireless long term evolution development.

Differentiated from wireline network, wireless network quality is relatively dynamic. It is impacted by the nature of the network's use (e.g., time spent by users to download data from the Internet), retransmit rates that are affected by signal to noise ratios, and by the nature of cell phone use. The easy-to-carry mobile phones are much more engaged with human activities than the wired phones, and hence the network traffic is heavily influenced by what people do. A very significant component in the variability of the wireless network's load and the perceived quality of service is social events. At large social events many cell phone users gather in a small area, such as a sports or concert venue, and—unless some provision is made—that causes network capability to overflow. To illustrate how significant an effect an event can have, it is noted that Super Bowl XLIV, for example, which was held at Sun Life Stadium (Miami Garden, Fla.), attracted about 75,000 people, where the normal population for Miami Garden is a bit over 100,000. The call traffic increase is probably much higher than the 175% population increase, and such an increase is not something that the wireless network is typically designed (or should be expected) to handle.

Clearly, it is important to anticipate events. Events such as the Super Bowl are easy to anticipate because they are scheduled months in advance, but there are many lesser events that cannot be easily anticipated because they are not scheduled well in advance. One way to anticipate events is to be aware of past events, and to predict future events based on the past events. Although many events can be accounted for from data other than actual network traffic data, a much more complete picture can be had by detecting events from the network data itself.

From a statistical point of view, in general, there are three types of event detection methods: outlier/change point based method, pattern based method, and model based method. For the model based event detection approach (which underlies the approach of this invention) different models have been constructed based on the characteristics of the measured data. For example, the Dynamic Bayesian Networks (DBNs) approach has been applied to detect abnormal events in underground coal mines, Markov random fields (MRFs) have been used to model spatial relationships at neighboring sensor nodes, and the Hidden Markov Model has been used on fMRI (functional Magnetic Resonance Imaging) to detect activation areas. Ihler et al in “Adaptive Event Detection With Time-Varying Poisson Processes,” in KDD '06, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, New York, N.Y., ACM, 2006, pp. 207-216, utilize a Markov Model Modulated Nonhomogeneous Poisson Process to detect events from highway traffic data collected by one sensor at a specific location.

In recent years, scan statistics have been a hot topic in spatial analysis and nowadays it appears to be the most effective “hotspots” detection method. The scan statistics are used to test a point process to see if it is purely random, or if any clusters of events are present. There are numerous variations of spatial scan statistics, but they share the three basic properties: the geometry of the scanned area, the probability distributions generating events under null hypothesis, and the shapes and sizes of the scanning window. The spatial scan statistics measure the log-likelihood ratio for a particular region to test spatial randomness. The region with the largest spatial scan statistic is the most likely to be generated by a different distribution. By extending the scan window from circular to cylindrical, the scan statistic extends from spatial domain to spatiotemporal domain. Scan statistics assumes that the null hypothesis is known or can be estimated through Monte Carlo simulation; but the null hypothesis assumption is often invalid and, moreover, the Monte Carlo simulation is computationally expensive.

SUMMARY

An advance in the art is realized with a method that collects data and subjects it to statistical analysis to detect localized events, which assists in network provisioning. Illustratively, the data employed is hourly network traffic count that is collected at cell sites. By taking the advantage of additive property of Poisson process, the disclosed method integrates spatial neighbor information by aggregating temporal data in various areas, and iteratively estimating the event location and the radius of event impact by examining the posterior probability base on the aggregated data.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 presents pseudo code that represents one embodiment in accord with the principles disclosed herein, and

FIG. 2 presents a flowchart that represents another embodiment in accord with the principles disclosed herein.

DETAILED DESCRIPTION

It is well established that network traffic varies with time of day, and also varies with days of the week. Identifying events in such network traffic data is ideally accomplished by learning the normal traffic pattern and special event pattern. However, this problem is challenging due to unknown baseline for normal traffic as well as unknown event information, such as event location, and event duration. Another challenge is the fact that not only the temporal information, but also the spatial information ought to be taken into account.

To accurately assess event influence to network, it is necessary to consider an event's impact on multiple neighboring cells, where the cells are likely to have different traffic patterns either naturally (e.g., proximity to a train station) or driven by different events. The large amount of data is another difficulty in the network traffic event detection the necessary computing might be unfeasible even though the computing increases only linearly with data.

Markov Modulated Poisson Process (MMPP) is a popular traffic model for capturing the characteristic of actual network load by describing varying rate parameters at irregular intervals according to Markov process which, basically asserts that the probability of a data point in a series depends on data points that immediately precede it. In “Bayesian Methods and Extensions for the Two State Markov Modulated Poisson Process,” S. L. Scott, in Ph.D. dissertation, Harvard University, Dept. of Statistics, 1998, extends the MMPP from homogeneous Poisson process to non-homogeneous Poisson process by embedding multiple periodic rates in Poisson process, and applies it to network intrusion detection and web traffic data. Ihler et al in the aforementioned article utilize the similar framework on freeway traffic and building entrance event detection. All the proposed methods focus on univariate time series.

To better appreciate the advance of this invention, it may be helpful to review the Markov Modulated Non-Homogeneous Poisson Process (MMNHPP) for modeling temporal data.

Let N^(i)(t) denote the observed traffic count at cell site i (iε

) and time t, where

denotes the considered region, and cell site i is at location L_(i), which is specified by its latitude, l1_(i) and longitude, l2_(i′), i.e., the vector L_(i)=[l1_(i),l2_(i)]. The actual traffic load (e.g., call count) at cell site i, as a function of reporting times, N^(i)(t), can be represented as N^(i)(t)=N₀ ^(i)(t)+N_(E) ^(i)(t), where N₀ ¹(t) is the normal traffic load, and N_(E) ^(i)(t) is the increased traffic load due to the presence of one or more events. It is sufficient to model N₀ ^(i)(t) and N_(E) ^(i)(t) instead of modeling N^(i)(t) directly. To model N₀ ^(i)(t) we adopt a non-homogeneous Poisson process with the rate λ^(i)(t) which, to incorporate the multiple periodic temporal patterns in network traffic, is assumed to be

λ^(i)(t)=λ₀ ^(i)σ_(d(t)) ^(i)η_(d(t),h(t)) ^(i),  (1)

where λ₀ ^(i) is the average rate of the Poisson process over a week at cell site i, σ_(d(t)) ^(i) is the day effect (d(t) indicates the day-of-week, dε{1, 2, . . . , 7}), and η_(d(t),h(t)) ^(i) is the hour effect (h(t) indicates the hour-of-day, hε{0, 1, . . . , 23}). Given a sequence of data, we assume that λ₀ ^(i) follows Gamma distribution, and σ_(d(t))η_(d(t),h(t)) follow Dirichlet distribution.

Now we consider the modeling of N_(E) ^(i)(t) for the case where events increase the network traffic during a short consistent period (in some applications, it may be more reasonable to consider the case where events decrease the traffic). To indicate the presence of an event at time t, we use a binary process z(t):

$\begin{matrix} {{z(t)} = \left\{ \begin{matrix} 0 & {{if}\mspace{14mu} {there}\mspace{14mu} {is}\mspace{14mu} {no}\mspace{14mu} {event}\mspace{14mu} {at}\mspace{14mu} {time}\mspace{14mu} t} \\ 1 & {{if}\mspace{14mu} {there}\mspace{14mu} {is}\mspace{14mu} {an}\mspace{14mu} {event}\mspace{14mu} {at}\mspace{14mu} {time}\mspace{14mu} t} \end{matrix} \right.} & (2) \end{matrix}$

The probability distribution of z(t) is defined to be a two-state Markov process with transition matrix:

$\begin{matrix} {M_{z} = \begin{pmatrix} {1 - z_{o}} & z_{1} \\ z_{0} & {1 - z_{1}} \end{pmatrix}} & (3) \end{matrix}$

where the expected value for the time between events is 1/z₀ and the expected value for event duration is 1/z₁. Using z(t), the event count N_(E) ^(i)(t) can be modeled as Poisson with the rate γ^(i)(t)

$\begin{matrix} {{N_{E}^{i}(t)} = \left\{ \begin{matrix} 0 & {{z(t)} = 0} \\ {P\left( {N^{i};{\gamma^{i}(t)}} \right)} & {{z(t)} = 1.} \end{matrix} \right.} & (4) \end{matrix}$

The unknown parameters in the models for N₀ ^(i)(t) and N_(E) ^(i)(t) can be estimated in the Bayesian framework. Essentially, Markov Chain Monte Carlo (MCMC) sampling is used to estimate the posterior probability p(z(t)=11|N(t)), as described in the aforementioned Ihler et al article.

Put in layman's terms, in the MMNHPP a given a set of data points is assumed to consist of data points that at times correspond to traffic with no special events present, and at times correspond to traffic that may be including a special event. There is, therefore, a distribution of traffic load measurements without an event, and a distribution of traffic load measurements with an event. The challenge is to find the parameters of the two distributions that best fit the data, under the assumption that those distributions are extended Poisson distributions, where the probability of k events in a given period of time is

${{f\left( {k,\lambda} \right)} = \frac{\lambda^{k}^{- \lambda}}{k!}},$

where λ is the expected number of event is that given period of time, it is a function of time t, and is different for the two conditions: with event, and without event.

Once the best-fitting parameters are chosen, the probability that a given data point belongs to a non-event data can be computed, and the probability that the same given data point belongs to event data can also be computed. If the probability that the given point belongs to event data is greater than the probability that the given point belongs to non-event data, then the conclusion is reached that the point belongs to an event.

How to find the best parameter estimates for the aforementioned distributions based on a given corpus of data is well known to artisans in the art of data analysis.

It may be noted that the model discussed above is for a time series at a single cell site i, and the spatial relations among multiple time series are not considered. In accord with the principles disclosed herein spatial information is taken into account.

Recognizing that “everything is related to everything else, but near things are more related than distant things,” our strategy is to aggregate a set of closely located time series of similar pattern. Specifically, we define a neighborhood region around the cell site i with the radius r as A_(i) ^(r)={j; ∥L_(J)−L_(i)∥<r}, where ∥L_(j)−L_(i)∥ represents the geographic distance between cell sites i and j. That is, the neighborhood of cell site i, A_(i) ^(r), encompasses at least one additional site.

The observations in A_(i) ^(r) can be represented as

N ^(A) ^(i) ^(r) =N ₀ ^(A) ^(i) ^(r) +N _(E) ^(A) ^(i) ^(r)   (5)

where N₀ ^(A) ^(i) ^(r) and N_(E) ^(A) ^(i) ^(r) are the total normal and event observations for all time series in area A _(i) ^(r) respectively. Thus, N₀ ^(A) ^(i) ^(r) and N₀ ^(A) ^(i) ^(r) can be represented as

${N_{0}^{A_{i}^{r}} = {{\sum\limits_{j \in A_{i}^{r}}{{N_{0}^{j}(t)}\mspace{14mu} {and}\mspace{14mu} N_{E}^{A_{i}^{r}}}} = {\sum\limits_{j \in A_{i}^{r}}{N_{E}^{j}(t)}}}},$

respectively.

According to the additive property of the non-homogeneous Poisson process, N₀ ^(A) ^(i) ^(r) is also a non-homogeneous Poisson process given that all time series in A_(i) ^(r) are independent Poisson random variables. Hence, the count rate for the neighborhood region A_(i) ^(r) can be expressed as

$\begin{matrix} \begin{matrix} {{\lambda_{0}^{A_{i}^{r}}(t)} = {\sum\limits_{j \in A_{i}^{r}}{\lambda_{0}^{j}(t)}}} \\ {= {\sum\limits_{j \in A_{i}^{r}}{{\lambda_{0}^{j}(t)}\sigma_{d{(t)}}^{j}{{h(t)}.}}}} \end{matrix} & (6) \end{matrix}$

We assume that if an event happens at a particular time, it affects the neighboring cells roughly simultaneously, i.e., the starting and ending points of the increased traffic for the affected cells are assumed to be similar enough. Then the temporal Markov process transition matrices for the neighboring cells are also assumed to be the same. We also utilize the fact that driven by the propagation of cellular radio signal, the farther the distance from the signal source, the weaker the signal strength. It is known that if the signal originates from a location L_(e), then the strength of the signal at location L_(i) can be expressed as

$\frac{a}{{{L_{e} - L_{i}}}^{n}},$

where n is a value between 2 and 4 depending on geography conditions, and a is a constant.

In addition to the cellular radio propagation property, from engineering design view, the closer the cell site to the signal, the higher the priority it has. The signal will be picked by farther cell only if the closer one is in overflow. Driven by the above, the spatial impact of an event can be modeled as binary function that relates the current location and the distance from where the event happens.

When an event takes place at location e, the event's impact at location i, can be expressed as a binary process, as follows:

$\begin{matrix} {s_{i}^{e} = \left\{ \begin{matrix} {0,} & {{{L_{e} - L_{i}}} > R_{e}} \\ {1,} & {{{L_{e} - L_{i}}} \leq R_{e}} \end{matrix} \right.} & (7) \end{matrix}$

where R_(e) is the radius of event impact. Combining (1) and (6), in spatiotemporal domain the presence of an event can be indicated by the product of z(t) and s_(i) ^(e). That is, if we let

$\begin{matrix} {{ST}_{it}^{e} = \left\{ \begin{matrix} {0,} & {{{{L_{e} - L_{i}}} > {R_{e}\mspace{14mu} {or}\mspace{14mu} {z(t)}}} = 0} \\ {1,} & {{{{L_{e} - L_{i}}} \leq {R_{e}\mspace{14mu} {and}\mspace{14mu} {z(t)}}} = 1} \end{matrix} \right.} & (8) \end{matrix}$

equation (8) implies that the event originates from e only impacts the cells in the area A_(e) ^(R) ^(e) while z(t)=1. Using equation (8), the increased observations due to the event can be modeled as a Poisson process:

$\begin{matrix} {\left. {N_{E}^{A_{e}^{R_{e}}}(t)} \right.\sim\left\{ \begin{matrix} {0,} & {{{while}\mspace{14mu} {ST}_{it}^{e}} = 0} \\ {P\left( {N;{\sum\limits_{j \in A_{e}^{R_{e}}}{\gamma^{j}(t)}}} \right)} & {{{while}\mspace{14mu} {ST}_{it}^{e}} = 1} \end{matrix} \right.} & (9) \end{matrix}$

From equations (8) and (9) is it obvious that an event impact is explained by its temporal duration, event location, and the impact radius. As discussed above, the temporal durations are assumed to be the same for all cells in the impacted area A_(e) ^(R) ^(e) and, hence, the duration can be estimated by Markov process using any of time series in the area A_(e) ^(R) ^(e) .

The method disclosed herein comprises collecting data, processing to obtain results, and utilizing the results. The processing, in turn, comprises initialization, aggregation, estimation, re-centralization, and adaptation, where the initialization, aggregation, estimation, re-centralization, and adaptation are iteratively repeated until a preselected criterion is met. The key tasks in each stage are presented in the following.

Initialization: Overall network traffic data is very voluminous so examining all these cell sites is prohibitively expensive in terms of computation cost. Therefore, in accord with one aspect of our disclosure we begin by identifying a subset of cell sites where a very simple test reveals that at least one event impacts the traffic. This is accomplished by choosing those cells whose peak traffic during the observed time period (the time series of data for the cell) exceeds the traffic value during a chosen portion of the observed time period (e.g., during 75% of the time period), by a preselected amount, and ranking the identified cells by the computed traffic level. We call the identified set the “seed” cell sites, or time series. We note that each event reveals itself as a “seed” in one or more cell sites. We also noted that the above-described approach for limiting the number of cells that are considered is merely illustrative, and that other approaches can be used without departing from the spirit and scope of this invention.

Aggregation: Choosing each cell in the seed time series we aggregate the data from all cells in a defined neighborhood of the chosen cell, and in an iterative process we increase the size of the neighborhood until a predetermined condition occurs (e.g., acquiring, albeit the smallest number of, cell sites).

Estimation: By fitting the aggregated time series with MMNHPP, we compute the posterior probability of event p(z(t)=1). If p(z(t)=1)>0.5 for time [t_(s), t_(e)] (i.e., time t spanning t_(s)-t_(e), and t_(e)-t_(s)>h hours (where h, for example, is 3 hours)), then we consider that all of aggregated the time series are affected by some event during the time period of [t_(s), t_(e)]; i.e., t_(s) and t_(e) the starting and ending time points of the event, respectively. Otherwise, we regard it as an outlier. For example, if there is a one hour spike in traffic, we do not consider that to be an event. For a specific detected event, the corresponding time series that were aggregated are the members of the cluster for the event.

Centralization: For each detected event cluster, we compute the center point by taking an average of the coordinates for all cells that are included in the cluster. The computed center point may be a simple geographical center of all cell sites in the cluster. The geographical center calculation is constrained to not exceed certain bounds, such as to not move farther away from the location of the seed cell than a certain distance. Alternatively, the geographical center can be a weighted calculation that takes account of both geographical locations and traffic levels.

Adaptation: We set the computed center as the new point about which a neighborhood is computed, and return to the step of aggregating the data from neighboring cells (starting with the existing size of the neighborhood). Repeat the aggregation, estimation, and centralization steps until a cell site (and a corresponding time series) is encompassed by the neighborhood but is not impacted by the event under consideration. The underlying assumption here is that if a set of time series with no event is aggregated to the time series with an event X, the effect of event X will be masked somewhat, and we will have reduced probability of concluding that an event occurs. In other words, the decision as to whether to further expand the neighborhood is based on statistical analysis of the aggregated time series (as disclosed above).

The result of the above process is that the center where the event is perceived to originate (in a center of gravity sense), the spatial impact of the event, and the temporal impact of the event become known.

It should be understood that there are various approaches for addressing all of the events that are contained in the data. That includes searching for event-impacts in time order, in order of seed strengths, or in any other order (including random).

FIG. 1 presents the pseudocode of one embodiment in accord with the principles disclosed herein, where the seed sites are sorted by strength, but once a seed site is under investigation, all events that impact that site are considered. Although the pseudocode is straight forward and self-explanatory, the following presents a relatively detailed explanation of the code.

In line 1, the variable m corresponds to the number of cell sites whose traffic data has been collected, max(N^(i)) is the maximum traffic load (e.g., number of calls) at cell site i, at some reporting time interval (e.g., hour), t. Q_(x)(N^(i)) is the traffic level that is not exceeded for x percent of the time, and TH is a chosen threshold. For example, the maximum number of calls in a certain hour of a certain date cell site i might be 1021 (i.e., max(N^(i))=1021), whereas during 75% of all other hours the number of calls in cell i does not exceed 750 (i.e., Q₇₅(N^(i))=750). Line 4 results in a sorted set of traffic load values D^(i), each thus identifying cell i where at least one event has an impact. These are seed cell sites.

Line 5 begins the process for considering each of the seed cell sites are considered, starting with a first cell site (i=1), and line 6 identifies spans of reporting times, or groups of consecutive reporting times, that correspond to times in the considered cell site during which there are event impacts. The number of consecutive reporting times that must be found to constitute a group is a preselected constant, h, such as the aforementioned three hours. The number of such groups is E^(i) (line 7).

Line 8 begins the process of considering each of the events in the considered cell site, starting with the earliest event, (j=1).

Line 9 computes the duration of event. That is, since a particular grouping of reporting times is considered, the duration of an event is defined by the starting time, and the stopping time; i.e., by [t_(s), t_(e)].

Line 10 evaluates whether the computed duration of event j is close (as far geographical location as well as starting and stopping times) to an already considered event that control passes to line 11, which adds the site of the seed to the corresponding cluster, increments index j and line 12 returns control to line 9 (to assess the event next in time on site i. Otherwise, control passes to line.

Line 14 initializes the iterative process, by setting the center location of the event at the geographical location of the cell site i (that is, the geographical coordinates of the cell site's antenna). It also chooses a circular area of a small initial radius r₀, sets the number of sites within that area, C^(A) ^(c) ^(r) , at 1, sets the duration of the event relative to the center to the duration at cell site i, and sets the change of overall probability of an event impacting within the area centered on center c to some number a>0.

The iterative process proceeds by testing whether the duration of the event relative to the center is approximately the same as the duration of the event relative to the geographical location of the cell site i, and whether the change of overall probability of an event impacting within the area centered on center c is positive. If so—and it is so in the first iterative loop by the initialization process—then the steps of lines 16-19 increase the radius (and thereby increase the area) until at least one other cell sites is found within the area.

At this point, line 21 computes a new geographical center (from the geographical coordinates of the encompassed cell sites) and line 22 sums the traffic loads of the encompassed cell sites. Line 23 employs the aforementioned statistical means for computing the duration of the event relative to the new center. Lastly, line 27 outputs the duration and expanse of the events.

FIG. 2 presents a block diagram of a second embodiment. Block 100 identifies the seeds pursuant to a process that, for example, follows steps 1-4 of FIG. 1. It is noted that any particular cell may have more than one seed (at different reporting times). The result is a set of seeds that, optionally, are not even sorted. Control then passes to block 102 where a first seed in the set is chosen (by setting variable i to 1), and control passes to block 104. Block 104 notes the geographical location of the cell site to which the chosen seed belongs and sets the current perception of the center of the event that is reflected by the seed to that geographical location. Control then passes to block 106 which identifies the duration of the event (i.e. the set of consecutive reporting times that correspond to the event) using the statistical approach disclosed above.

It is possible that the considered seed (other than the very first seed, of course) was already accounted for while considering a previous seed. Therefore, control passes from block 106 to block 108, which considers whether the seed i that is to be currently considered has been previously handled when considering a previous seed, j. If it has been previously considered, control passes to block 124. Otherwise, control passes to block 110, which defines the smallest area (for example, a circular area about the event's perceived center with the smallest radius) that results in the addition of a cell site (from among all geographically neighboring cell sites; that is, Δk>0, where k is the number of cell sites that are encompassed by the chosen area. It should be understood that the initial area or territory that is chosen is one that includes the site where the seed event resides plus some minimum number of additional sites. That area can be circular, thus being defined by a radius, and the radius can begin with some minimum value that is iteratively increased until another site is encompassed, or it can start with an incremental increase over the distance from the site where the seed event resides to the geographically next closest site. It is understood, of course, that an increase of the neighborhood that results in the addition of one cell site may result in the addition of a number of cell sites.

From block 110 control passes to block 112 where the traffic loads of the cell sites encompassed by the chosen area are aggregated (e.g., summed), and control passes to block 114, which determines, based on the statistical approach disclosed above (see line 23 in FIG. 1) whether the traffic count that is attributable to the event has increased. If so, control passes to block 114 where the event's duration is re-determined, and control passes to block 116, which computes the event's duration and passes control to block 118, which enlarges the geographical area of investigation only so much as to increase the number of encompassed cell sites. Control then passes to block 120 which re-computes the perceived event center and re-establishes the set of cell sites encompassed by the existing neighborhood size before returning control to block 112.

When block 114 concludes in the negative (that the traffic count attributable to the event has not increased), control passes to block 122, which stores the information about the addressed event, its perceived center and reach (i.e., the last-employed radius), and passes control to block 124. Block 124 determines whether the addressed seed is the last seed to be addressed. If not, control passes to block 128 which increments index I and returns control to block 104. Otherwise, control passes to block 126, which sends the information stored by block 124 to whatever network provisioning system the user of the method desires. This may comprise, for example, a schedule that is created from the stored information for delivering portable cells (“cells on wheels”) to the appropriate geographical areas so that they can be employed when future events are expected.

The above embodiments descriptions are, of course, illustrative, and other embodiments can be realized by a person skilled in the art. For example, Additionally, while the above disclosure is couched in terms of a cellular network and cell sites, it should be realized that this, too, is merely illustrative and that any access point (AP) via which traffic can enter the telecommunication network, can serve as data sources 

1. A method, executed on a processing platform, for enabling a wireless network to be provisioned, comprising: collecting from access points (APs) of said network traffic volume data in successive time intervals; identifying event seeds, which are those of said APs where during one or more time spans of a preselected number contiguous ones of said time intervals the traffic volume in said time intervals exceeds a chosen threshold; processing each of the event seeds, through iterative processing cycles, to identify for each of said event seeds an estimated event center and associated event impact territory; and providing information about the events identified by said processing to a provisioning system of said wireless network.
 2. The method of claim 1 where said territory is expressed by a radius of a circle centered about said associated event center.
 3. The method of claim 1 where the processing in each of the processing cycles includes statistical analysis.
 4. The method of claim 3 where said statistical analysis is a Markov Modulated Nonhomogeneous Poisson Process that is employed to estimate probability with which said traffic data is indicative of an event.
 5. The method of claim 1 where each of said iterative processing cycles includes statistical analysis, and each such cycle begins with one of said event seeds, which occurs at a particular AP, an estimated event center that is associated with geographical coordinates of said particular AP, and a territory that encompasses said particular AP and a minimum number, greater than zero, of neighboring APs, and at each of said cycles enlarging said territory and augmenting said estimated event center based on the APs encompassed by said enlarged territory, until a preselected condition is met that terminates said iterative processing.
 6. The method of claim 1 where said territory is defined by a radius of a circle about said event center, and at each cycle of the iterative processing said radius is enlarged only so much as to encompass a minimum number of APs that were not already encompassed in the immediately previous cycle.
 7. The method of claim 1 where said condition is met when traffic attributed to said event is not increased with the enlarged territory.
 8. The method of claim 1 where said steps of collecting from access points (APs) of said network traffic volume data in successive time intervals and identifying event seeds, which are those of said APs where during one or more time spans of a preselected number contiguous ones of said time intervals the traffic volume in said time intervals exceeds a chosen threshold are executed in a method that comprises the step of: 1 for i from 1 to m 2 calculate D^(i) = max(N^(i))−Q_(x)(N^(i))−TH 3 end for

where i is an index that pertains to an AP of said APs, m is the number of APs of said network, the APs are identified are those for which D^(i) is greater than 0, max(N^(i)) is maximum experienced traffic during a preselects span of time, Q_(x)(N^(i)) is traffic level that is exceeded x percent of said preselected span of time, and TH is said threshold.
 9. The method of claim 8 where said step of processing each of the event seeds comprising the steps of: 1 for i from 1 to n 2   find groups of h or more consecutive reporting times t such that, h being an integer, p(z(t) = 1|N^(i)(t)) > 0.5 3   E^(i) = # of such groups, each is an impacting event 4   for j from 1 to E^(i) 5     compute event duration TD_(j) ^(i) 6     if (TD_(j) ^(i) is close to already considered event) then 7      add site to the corresponding cluster j = j + 1 8      go to line 6 9     end if 10     initialize:     center c = location of cell site i,     radius, r = r₀ of a neighborhood area,     A_(c) ^(r), about center c,     number of time series in A_(c) ^(r), C^(A) ^(c) ^(r) = 1,      ${{\Delta \; C^{A_{c}^{r}}} = 0},\; {{TD}_{j}^{c} = {{{TD}_{j}^{i}\mspace{14mu} \Delta {\sum\limits_{t = t_{e}}^{t_{s}}\; {\overset{\_}{N}}_{E}^{A_{c}^{r}}}} = {a > 0}}}$ 11      ${{while}\mspace{14mu} {TD}_{j}^{i}} \approx {{TD}_{j}^{c}\mspace{14mu} {and}\mspace{14mu} \Delta {\sum\limits_{t = t_{e}}^{t_{s}}\; {\overset{\_}{N}}_{E}^{A_{c}^{r}}}} > 0$ 12       while ΔC^(A) ^(c) ^(r) = 0 13         r = r + Δr 14         compute ΔC^(A) ^(c) ^(r) (C^(A) ^(c) ^(r) = C^(A) ^(c) ^(r) + ΔC^(A) ^(c) ^(r) ) 15       end while 16       I^(A) ^(c) ^(r) is site indices comprising C^(A) ^(c) ^(r) 17       compute new center, c 18        N ^(A) ^(c) ^(r) (t) = sum of N^(k), k ε I^(A) ^(c) ^(r) 19       compute N _(E) ^(A) ^(c) ^(r) (t) and duration TD_(j) ^(c) 20     end while 21     output 22   end for 23 end for

where i is an index that pertains to said event seeds, n is number of identified event seeds, p(z(t) is a probability measure that is developed by employing statistical analysis, and symbol ≈ stands for approximately equal. 